Algorithm for Multiplying Schubert Classes
نویسندگان
چکیده
Based on the multiplicative rule of Schubert classes obtained in [Du3], we present an algorithm computing the product of two arbitrary Schubert classes in a flag variety G/H, where G is a compact connected Lie group and H ⊂ G is the centralizer of a one-parameter subgroup in G. Since all Schubert classes on G/H constitute an basis for the integral cohomology H∗(G/H), the algorithm gives a method to compute the cohomology ring H∗(G/H) independent of the classical spectral sequence method due to Leray [L1,L2] and Borel [Bo1, Bo2]. 2000 Mathematical Subject Classification: 14N15; 14M10 (55N33; 22E60).
منابع مشابه
Restriction Varieties and Geometric Branching Rules
This paper develops a new method for studying the cohomology of orthogonal flag varieties. Restriction varieties are subvarieties of orthogonal flag varieties defined by rank conditions with respect to (not necessarily isotropic) flags. They interpolate between Schubert varieties in orthogonal flag varieties and the restrictions of general Schubert varieties in ordinary flag varieties. We give ...
متن کاملMultiplicative rule of Schubert classes
Let G be a compact connected Lie group and H, the centralizer of a one-parameter subgroup in G. Combining the ideas of Bott-Samelson resolutions of Schubert varieties and the enumerative formula on a twisted product of 2 spheres obtained in [Du2], we obtain a closed formula for multiplying Schubert classes in the flag manifold G/H. 2000 Mathematical Subject Classification: 14N15 (14M10).
متن کاملThe Chow rings of generalized Grassmanianns
Based on the formula for multiplying Schubert classes obtained in [D2] and programed in [DZ1], we introduce a new method to compute the Chow ring of a flag variety G/H . As applications the Chow rings of some generalized Grassmannians G/H are presented as the quotients of polynomial rings in the special Schubert classes on G/H .
متن کاملRC-Graphs and Schubert Polynomials
Bergeron was supported by the National Science Foundation. Billey was supported by the National Physical Science Consortium, IBM and UCSD. Using a formula of Billey, Jockusch and Stanley, Fomin and Kirillov have introduced a new set of diagrams that encode the Schubert polynomials. We call these objects rc-graphs. We define and prove two variants of an algorithm for constructing the set of all ...
متن کاملRc - Graphs and a Generalized Littlewood - Richardson Rule
Using a generalization of the Schensted insertion algorithm to rcgraphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 16 شماره
صفحات -
تاریخ انتشار 2006